Network Flow Spanners
نویسندگان
چکیده
In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, link failures, network survivability, etc., we introduce a new notion of flow spanner, where one seeks a spanning subgraph H = (V,E′) of a graph G = (V,E) which provides a “good” approximation of the source-sink flows in G. We formulate few variants of this problem and investigate their complexities. A special attention is given to the version where H is required to be a tree.
منابع مشابه
Approximating Maximum Flow in Polygonal Domains using Spanners
We study a maximum flow problem in a polygonal domain P : Determine the maximum number of disjoint “thick” paths (of specified width w) through P from a source edge to a sink edge of P . We show that Euclidean spanners offer a means of computing approximately optimal solutions. For a polygonal domain with n vertices and h point holes, we give a 1/2-approximation algorithm that runs in time O(n ...
متن کاملIndependent tree spanners: fault-tolerant spanning trees with constant distance guarantees
For any xed rational parameter t 1, a (tree) t{spanner of a graph G is a spanning subgraph (tree) T in G such that the distance between every pair of vertices in T is at most t times their distance in G. General t{spanners and their variants have multiple applications in the eld of communication networks, distributed systems, and network design. In this paper, we combine the two concepts of sim...
متن کامل–Completeness Results for Minimum Planar Spanners
For any fixed parameter , a –spanner of a graph is a spanning subgraph in which the distance between every pair of vertices is at most times their distance in . A minimum –spanner is a –spanner with minimum total edge weight or, in unweighted graphs, minimum number of edges. General –spanners and their variants have multiple applications in the field of communication networks, distributed syste...
متن کاملThe emergence of sparse spanners and well-separated pair decomposition under anarchy
A spanner graph on a set of points in Rd provides shortest paths between any pair of points with lengths at most a constant factor of their Euclidean distance. A spanner with a sparse set of edges is thus a good candidate for network backbones, as desired in many practical scenarios such as the transportation network and peer-to-peer network overlays. In this paper we investigate new models and...
متن کاملTree Spanners
A tree t-spanner T of a graph G is a spanning tree in which the distance between every pair of vertices is at most t times their distance in G. This notion is motivated by applications in communication networks, distributed systems, and network design. This paper studies graph theoretic, algorithmic and complexity issues about tree spanners. It is shown that a tree 1-spanner, if it exists, in a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006